Coupled-decompositions: exploiting primal–dual interactions in convex optimization problems
نویسندگان
چکیده
منابع مشابه
Coupled-decompositions: exploiting primal-dual interactions in convex optimization problems
Decomposition techniques implement the so-called “divide and conquer” in convex optimization problems, being primal and dual decompositions the two classical approaches. Although both solutions achieve the goal of splitting the original program into several smaller problems (called the subproblems), these techniques exhibit in general slow speed of convergence. This is a limiting factor in prac...
متن کاملConvex Decompositions
We consider decompositions S of a closed, convex set P into smaller, closed and convex regions. The thin convex decompositions are those having a certain strong convexity property as a set of sets. Thin convexity is directly connected to our intended application in voting theory (see [8, 9]), via the consistency property for abstract voting systems. The facial decompositions are those for which...
متن کاملExploiting Parallel Hardware in Solving Optimization Problems
Making an optimal choice, given a number of possibilities and constraints, is a fundamental problem in economics and engineering. Examples include the optimal choice of a portfolio of stocks, given a budget and diversity requirements; the optimal design of a truss, given certain load requirements; and the determination of an optimal production plan, given the current manufacturing equipment. In...
متن کاملExploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP’s) the standard technique of invoking a separate recursion to solve each independent component can significantly reduce the strength of the bounds that can be applied when using branch and bound techniques. In this paper we present a new search a...
متن کاملUnified Methods for Exploiting Piecewise Linear Structure in Convex Optimization
We develop methods for rapidly identifying important components of a convex optimization problem for the purpose of achieving fast convergence times. By considering a novel problem formulation—the minimization of a sum of piecewise functions—we describe a principled and general mechanism for exploiting piecewise linear structure in convex optimization. This result leads to a theoretically justi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2013
ISSN: 1687-6180
DOI: 10.1186/1687-6180-2013-41